Inference and Verification in Medical Appropriateness Criteria Using Gröbner Bases
نویسندگان
چکیده
In this article techniques borrowed from Computer Algebra (Gröbner Bases) are applied to deal with Medical Appropriateness Criteria including uncertainty. The knowledge was provided in the format of a table. A previous translation of the table into the format of a “Rule Based System” (denoted RBS) based on a three-valued logic is required beforehand to apply these techniques. Once the RBS has been obtained, we apply a Computer Algebra based inference engine, both to detect anomalies and to infer new knowledge. A specific set of criteria for coronary artery surgery (originally presented in the form of a table) is analyzed in detail.
منابع مشابه
New developments in the theory of Gröbner bases and applications to formal verification
We present foundational work on standard bases over rings and on Boolean Gröbner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems arising from formal verification of digital circuits. In fact, algebraic modelling of formal verification problems is developed on the word-level as well as on t...
متن کاملCriteria for Finite Difference Gröbner Bases of Normal Binomial Difference Ideals
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F {y} to have finite difference Gröbner bases and an algorithm to compute the finite difference Gröbner bases if these criteria are satisfied. The novelty of these criteria lies in the fact that complicated properties about difference polynomial ideals are reduc...
متن کاملTim Pruss , Priyank Kalla , Senior Member , IEEE , and
Abstraction plays an important role in digital design, analysis and verification. This paper introduces a word-level abstraction of the function implemented by a combinational logic circuit. The abstraction provides a canonical representation of the function as a polynomial Z =F (A) over the finite field F2k , where Z,A represent the k-bit word-level output and input of the circuit, respectivel...
متن کاملNormal Forms for Operators via Gröbner Bases in Tensor Algebras
We propose a general algorithmic approach to noncommutative operator algebras generated by linear operators using quotients of tensor algebras. In order to work with reduction systems in tensor algebras, Bergman’s setting provides a tensor analog of Gröbner bases. We discuss a modification of Bergman’s setting that allows for smaller reduction systems and tends to make computations more efficie...
متن کاملExperimental Analysis of Involutive Criteria
In this paper we present results of our computer experiments to study effectiveness of involutive criteria for avoiding useless prolongations in construction of polynomial Janet bases. These bases are typical representative of involutive bases. Though involutive bases are usually redundant as Gröbner ones, they can be used as well as the reduced Gröbner bases in whose theory Volker Weispfenning...
متن کامل